Successive Convex Approximations to Cardinality-Constrained Quadratic Programs: A DC Approach
نویسندگان
چکیده
Cardinality-Constrained Quadratic Programs: A DC Approach Xiaojin Zheng School of Economics and Management, Tongji University, Shanghai 200092, P. R. China, [email protected] Xiaoling Sun Department of Management Science, School of Management, Fudan University, Shanghai 200433, P. R. China, [email protected] Duan Li Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong, [email protected] Jie Sun Department of Decision Sciences and Risk Management Institute, National University of Singapore, Singapore 117245, [email protected]
منابع مشابه
Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach
In this paper we consider cardinality-constrained convex programs that minimize a convex function subject to a cardinality constraint and other linear constraints. This class of problems has found many applications, including portfolio selection, subset selection and compressed sensing. We propose a successive convex approximation method for this class of problems in which the cardinality funct...
متن کاملDouglas-Rachford Splitting for Cardinality Constrained Quadratic Programming
In this report, we study the class of Cardinality Constrained Quadratic Programs (CCQP), problems with (not necessarily convex) quadratic objective and cardinality constraints. Many practical problems of importance can be formulated as CCQPs. Examples include sparse principal component analysis [1], [2], cardinality constrained mean-variance portfolio selection problem [3]–[5], subset selection...
متن کاملA new algorithm for solving 3D contact problems with Coulomb friction
The paper deals with solving of contact problems with Coulomb friction for a system of 3D elastic bodies. The iterative method of successive approximations is used in order to find a fixed point of certain mapping that defines the solution. In each iterative step, an auxiliary problem with given friction is solved that is discretized by the FETI method. Then the duality theory of convex optimiz...
متن کاملA Binarisation Approach to Non-Convex Quadratically Constrained Quadratic Programs
The global optimisation of non-convex quadratically constrained quadratic programs is a notoriously difficult problem, being not only NP-hard in the strong sense, but also very difficult in practice. We present a new heuristic approach to this problem, which enables one to obtain solutions of good quality in reasonable computing times. The heuristic consists of four phases: binarisation, convex...
متن کاملSDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کامل